Combinatorial Statistics on Non-crossing Partitions

نویسنده

  • Rodica Simion
چکیده

Four statistics, ls, rb, rs, and lb, previously studied on all partitions of { 1, 2, ..., n }, are applied to non-crossing partitions. We consider single and joint distributions of these statistics and prove equidistribution results. We obtain qand p, q-analogues of Catalan and Narayana numbers which refine the rank symmetry and unimodality of the lattice of non-crossing partitions. Two unimodality conjectures, one of which pertains to Young's lattice, are stated. We exhibit relations between statistics on non-crossing partitions and established permutation statistics applied to restricted permutations. All our proofs are combinatorial, relying on the construction of bijective correspondences and on structural properties of the lattice of non-crossing partitions. © 1994 Academic Press, Inc.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Free Probability Theory and Non-crossing Partitions

Voiculescu's free probability theory { which was introduced in an operator algebraic context, but has since then developed into an exciting theory with a lot of links to other elds { has an interesting combinatorial facet: it can be described by the combinatorial concept of multiplicative functions on the lattice of non-crossing partitions. In this survey I want to explain this connection { wit...

متن کامل

Séminaire Lotharingien de Combinatoire, B39c(1997), 38pp. FREE PROBABILITY THEORY AND NON-CROSSING PARTITIONS

Voiculescu’s free probability theory – which was introduced in an operator algebraic context, but has since then developed into an exciting theory with a lot of links to other fields – has an interesting combinatorial facet: it can be described by the combinatorial concept of multiplicative functions on the lattice of non-crossing partitions. In this survey I want to explain this connection – w...

متن کامل

Two Statistics Linking Dyck Paths and Non-crossing Partitions

We introduce a pair of statistics, maj and sh, on Dyck paths and show that they are equidistributed. Then we prove that this maj is equivalent to the statistics ls and rb on non-crossing partitions. Based on non-crossing partitions, we give the most obvious q-analogue of the Narayana numbers and the Catalan numbers.

متن کامل

Positroids and Non-crossing Partitions

We investigate the role that non-crossing partitions play in the study of positroids, a class of matroids introduced by Postnikov. We prove that every positroid can be constructed uniquely by choosing a non-crossing partition on the ground set, and then freely placing the structure of a connected positroid on each of the blocks of the partition. This structural result yields several combinatori...

متن کامل

Non-crossing Linked Partitions and Multiplication of Free Random Variables

The material gives a new combinatorial proof of the multiplicative property of the S-transform. In particular, several properties of the coefficients of its inverse are connected to non-crossing linked partitions and planar trees. AMS subject classification: 05A10 (Enumerative Combinatorics); 46L54(Free Probability and Free Operator Algebras).

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Comb. Theory, Ser. A

دوره 66  شماره 

صفحات  -

تاریخ انتشار 1994